A workshop on approximation algorithms for combinatorial optimization problems focussing on algorithmic and complexity aspects arising in the development of efficient approximate solutions to computationally difficult problems. It aims, in particular,...
4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2001) and 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2001). Berkeley, California; August 1...
Research programme at the Isaac Newton Institute, Cambridge UK. Themes include: Randomised algorithms; "Phase transitions" in statistical physics and computer science; Random graphs and structures. August -- December 2002.